Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities
نویسندگان
چکیده
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in decision trees. More precisely, we investigate this problem from the computational viewpoint. When the decision tree is separable (to be defined in the paper), we provide an operational approach to compute an optimal strategy, based on a bicriteria dynamic programming procedure. The results of numerical tests are presented. When the decision tree is non-separable, we prove the NP-hardness of the problem.
منابع مشابه
Information Processing under Imprecise Risk with the Hurwicz criterion
An agent has Hurwicz criterion with pessimismoptimism index α under imprecise risk and adopts the root dictatorship version of McClennen’s Resolute Choice in sequential decision situations, i.e. evaluates strategies at the root of the decision tree by the Hurwicz criterion and enforces the best strategy, thus behaving in a dynamically consistent manner. We address two questions raised by this t...
متن کاملVariable Selection Bias in Classification Trees Based on Imprecise Probabilities
Classification trees are a popular statistical tool with multiple applications. Recent advancements of traditional classification trees, such as the approach of classification trees based on imprecise probabilities by Abellán and Moral (2005), effectively address their tendency to overfitting. However, another flaw inherent in traditional classification trees is not eliminated by the imprecise ...
متن کاملVariable Selection in Classification Trees Based on Imprecise Probabilities
Classification trees are a popular statistical tool with multiple applications. Recent advancements of traditional classification trees, such as the approach of classification trees based on imprecise probabilities by Abellán and Moral (2004), effectively address their tendency to overfitting. However, another flaw inherent in traditional classification trees is not eliminated by the imprecise ...
متن کاملMASTER THESIS by Paul Fink Ensemble methods for classification trees under imprecise probabilities
In this master thesis some properties of bags of imprecise classification trees, as introduced in Abellán and Masegosa (2010), are analysed. In the beginning the statistical background of imprecise classification trees is outlined – starting with an overview on measuring uncertainty within the concept of Dempster–Shafer theory is presented, followed by a discussion of its application in a tree–...
متن کاملA Minimal Extension of Bayesian Decision Theory
Savage denied that Bayesian decision theory applies in large worlds. This paper proposes a minimal extension of Bayesian decision theory to a large-world context that evaluates an event E by assigning it a number π(E) that reduces to an orthodox probability for a class of measurable events. The Hurwicz criterion evaluates π(E) as a weighted arithmetic mean of its upper and lower probabilities, ...
متن کامل